Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
نویسندگان
چکیده
We present new complexity results on answer set checking for nonground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is important. In particular, we consider set-based and bitmap-based representations, which are popular in implementations of Answer Set Programming systems. Furthermore, we present new complexity results for various reasoning tasks under the assumption that predicate arities are bounded by some constant. These results imply that in such a setting – which appears to be a reasonable assumption in practice – more efficient implementations than those currently available may be feasible.
منابع مشابه
Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
Answer Set Programming has become a host for expressing knowledge representation problems, which reinforces the interest in efficient methods for computing answer sets of a logic program. While for propositional programs, the complexity of this task has been amply studied and is wellunderstood, less attention has been paid to the case of nonground programs, which is much more important from a K...
متن کاملEvaluation of Answer Set Programs with Bounded Predicate Arities
We consider the class of logic programs under the restriction of bounded predicate arities. Previous results showed that the complexity answer set semantics for such class of logic programs is lower than unrestricted programs. In particular, evaluation under answer set semantics is possible within polynomial space. However, current ASP solvers and grounders do not seem to respect this complexit...
متن کاملNon-ground Answer Set Programming
We present new complexity results on answer set checking for non-ground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is important. In particular, we consider setbased and bitmap-based representations, which are popular in implementations of Answer Set Programming systems. Furthermore, we present new...
متن کاملSpace Efficient Evaluation of ASP Programs with Bounded Predicate Arities
Answer Set Programming (ASP) has been deployed in many applications, thanks to the availability of efficient solvers. Most programs encountered in practice have an important property: Their predicate arities are bounded by a constant, and in this case it is known that the relevant computations can be done using polynomial space. However, all competitive ASP systems rely on grounding, due to whi...
متن کاملAnswer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier work where bounded model checking has been used for verification of sequential digital circuits. As the model of asynchronous systems a generalization of communicating automata, 1-safe Petri nets, are used. A mapping fr...
متن کامل